Propositional Tree Automata
نویسندگان
چکیده
In the paper, we introduce a new tree automata framework, called propositional tree automata, capturing the class of tree languages that are closed under an equational theory and Boolean operations. This framework originates in work on developing a su cient completeness checker for speci cations with rewriting modulo an equational theory. Propositional tree automata recognize regular equational tree languages. However, unlike regular equational tree automata, the class of propositional tree automata is closed under Boolean operations. This extra expressiveness does not a ect the decidability of the membership problem. This paper also analyzes in detail the emptiness problem for propositional tree automata with associative theories. Though undecidable in general, we present a semi-algorithm for checking emptiness based on machine learning that we have found useful in practice.
منابع مشابه
Tree Automata, Mu-calculus and Determinacy
We show that the propositional Mu-Calculus is equivalent in expressive p o wer to nite automata on inn-nite trees. Since complementation is trivial in the Mu-Calculus, our equivalence provides a radically sim-pliied, alternative proof of Rabin's complementation lemma for tree automata, which is the heart of one of the deepest decidability results. We also show h o w Mu-Calculus can be used to e...
متن کاملUsing Tree Automata to Investigate Intuitionistic Propositional Logic
Intuitionistic logic is an important variant of classical logic, but it is not as well-understood, even in the propositional case. In this thesis, we describe a faithful representation of intuitionistic propositional formulas as tree automata. This representation permits a number of consequences, including a characterization theorem for free Heyting algebras, which are the intutionistic analogu...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملModel Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such entities through computation steps, since this requires the ability to freely mix quantification and temporal operators. In this paper we study Quantified Computation Tree Logic (QCTL), which extends the well-known p...
متن کاملA New Proof of Exponential Decidability for the Propositional -calculus with Program Converse
The propositional-Calculus (C) is a powerful propositional program logic with xpoints. C decidability with exponential upper bound was sketched for the rst time in 1988 by E. A. Emerson and Ch. S. Jutla on base of automata-theoretic technique, while a complete proof was published in 1999 only. Meanwhile M. Vardi sketched in 1998 an automata-theoretic proof of exponential decidability for the pr...
متن کامل